Constraint Deduction in an Interval-based Temporal Logic
نویسندگان
چکیده
In this paper, reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop are described. A constraint deduction approach is proposed and compared with a sequent calculus which has been developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.
منابع مشابه
Temporal Token Calculus: a Temporal Reasoning Approach for Knowledge-Based
Most of AI research on temporal reasoning has been devoted to either exploring constraint-based temporal deduction techniques or investigating diverse logics extended with time. Nevertheless the formal study of deductive systems for such temporal extended logics has received little attention. This paper presents a general framework for temporal reasoning in knowledge-based systems resulting fro...
متن کاملTemporal Deduction in a Graphical Logic
Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have implemented an automated deduction system for Graphical Interval Logic that includes a graphical user interface and an ...
متن کاملAutomated Deduction in a Graphical Temporal Logic
Real-Time Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automated deduction system for the logic, which includes a theorem prover and a user interface. ...
متن کاملCompleteness of Category-Based Equational Deduction
Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...
متن کاملCategory-based constraint logic
This research exploits the view of constraint programming as computation in a logical system, namely constraint logic. The basic ingredients of constraint logic are: constraint models for the semantics (they form a comma-category over a fixed model of “built-ins”), generalized polynomials in the rôle of basic syntactic ingredient, and a constraint satisfaction relation between semantics and syn...
متن کامل